Maximum subsets of (0,1] with no solutions to x+y = kz

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximum subsets of (0, 1] with no solutions to x+y = kz

If k is a positive real number, we say that a set S of real numbers is k-sum-free if there do not exist x, y, z in S such that x+y = kz. For k greater than or equal to 4 we find the essentially unique measurable k-sum-free subset of (0, 1] of maximum size.

متن کامل

Maximum subsets of ( 0 , 1 ] with no solutions to x

If k is a positive integer we say that a set S of real numbers is k-sum-free if there do not exist x, y, x is S such that x + y = kz. For k greater than or equal to 4 we find the essentially unique measurable k-sum-free subset of (0, 1] of maximum size.

متن کامل

The Structure of Maximum Subsets of {1, ..., n} with No Solutions to a+b = kc

If k is a positive integer, we say that a set A of positive integers is k-sum-free if there do not exist a, b, c in A such that a + b = kc. In particular we give a precise characterization of the structure of maximum sized k-sum-free sets in {1, . . . , n} for k ≥ 4 and n large.

متن کامل

Rational solutions of KZ equation, case S4.

We consider the Knizhnik-Zamolodchikov system of linear differential equations. The coefficients of this system are generated by elements of the symmetric group S n. We separately investigate the case S 4. In this case we solve the corresponding KZ-equation in the explicit form.

متن کامل

Well-dispersed subsets of non-dominated solutions for MOMILP ‎problem

This paper uses the weighted L$_1-$norm to propose an algorithm for finding a well-dispersed subset of non-dominated solutions of multiple objective mixed integer linear programming problem. When all variables are integer it finds the whole set of efficient solutions. In each iteration of the proposed method only a mixed integer linear programming problem is solved and its optimal solutions gen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 1995

ISSN: 1077-8926

DOI: 10.37236/1225